Influence of coin symmetry on infinite hitting times in quantum walks
نویسندگان
چکیده
Classical random walks on finite graphs have an underrated property: a walk from any vertex can reach every other in time, provided they are connected. Discrete-time quantum connected however, infinite hitting times. This phenomenon is related to graph symmetry, as previously characterized by the group of direction-preserving automorphisms that trivially affect coin Hilbert space. If symmetric enough (in particular sense) then associated unitary will contain eigenvectors do not overlap set target vertices, for flip operator. These span Infinite Hitting Time (IHT) subspace. Quantum states IHT subspace never leading However, this whole story: 3D cube does satisfy symmetry constraint, yet with certain coins exhibit We study effect analyzing coin-permutation symmetries (CPS): act nontrivially space but leave operator invariant. Unitaries using highly large CPS groups, such permutation-invariant Grover coin, higher probabilities arriving, result their larger subspaces.
منابع مشابه
Hitting Times for Random Walks with Restarts
The time it takes a random walker in a lattice to reach the origin from another vertex x, has infinite mean. If the walker can restart the walk at x at will, then the minimum expected hitting time γ(x, 0) (minimized over restarting strategies) is finite; it was called the “grade” of x by Dumitriu, Tetali and Winkler. They showed that, in a more general setting, the grade (a variant of the “Gitt...
متن کاملGraph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
In this paper, we explore analytically and experimentally a quasi-quantum analogue of the hitting time of the continuous-time quantum walk on a graph. For the classical random walk, the hitting time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved performance. Our analysis shows that the quasi-quantum analogue of the hitt...
متن کامل1 A ug 2 00 8 On the hitting times of quantum versus random walks ∗
The hitting time of a classical random walk (Markov chain) is the time required to detect the presence of – or equivalently, to find – a marked state. The hitting time of a quantum walk is subtler to define; in particular, it is unknown whether the detection and finding problems have the same time complexity. In this paper we define new Monte Carlo type classical and quantum hitting times, and ...
متن کاملSymmetry in Quantum Walks
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. We derive an expression for hitting time using superoperators, and numerically evaluate it for the walk on the hypercube for various ...
متن کاملHitting times for random walks on vertex-transitive graphs
For random walks on finite graphs, we record some equalities, inequalities and limit theorems (as the size of graph tends to infinity) which hold for vertex-transitive graphs but not for general regular graphs. The main result is a sharp condition for asymptotic exponentiality of the hitting time to a single vertex. Another result is a lower bound for the coefficient of variation of hitting tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2022
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.105.032206